Spread decoding in extension fields
نویسندگان
چکیده
A spread code is a set of vector spaces of a fixed dimension over a finite field Fq with certain properties used for random network coding. It can be constructed in different ways which lead to different decoding algorithms. In this work we consider one such representation of spread codes and present a minimum distance decoding algorithm which is efficient when the codewords, the received space and the error space have small dimension.
منابع مشابه
An algebraic approach for decoding spread codes
We present a family of constant–dimension codes for random linear network coding called spread codes. This is a family of optimal codes with maximum minimum distance. A spread code is constructed starting from the algebra defined by the companion matrix of an irreducible polynomial. We give a minimum distance decoding algorithm that is particularly efficient when the dimension of the codewords ...
متن کاملOptimum decoder for multiplicative spread spectrum image watermarking with Laplacian modeling
This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...
متن کاملتجزیه و تحلیل عملکرد کدهای کانولوشنال تعریف شده در میدان حقیقی در کانال فیدینگ و در حضور نویز کوانتیزاسیون
Channel coding is one of the techniques used for suppression of fading and channel noise effects. Most of the researches on channel codes have been focused on the codes which are defined on Galois fields. Since two decades ago, using channel codes defined on Real and Complex fields has been considered for joint sourcechannel coding in multimedia transmission; but most of the works have focused ...
متن کاملOn Belief Propagation Decoding of LDPC Codes over Groups
We introduce a wide class of LDPC codes, large enough to include LDPC codes over finite fields, rings or groups as well as some non-linear codes. This class is defined by an extension of the parity-check equations involved in the code’s definition. A belief propagation decoding procedure with the same complexity as for the decoding of LDPC codes over finite fields is presented for theses new pa...
متن کاملPartial spreads in random network coding
ABSTRACT. Following the approach by R. Kötter and F. R. Kschischang, we study network codes as families of k-dimensional linear subspaces of a vector space Fq , q being a prime power and Fq the finite field with q elements. In particular, following an idea in finite projective geometry, we introduce a class of network codes which we call partial spread codes. Partial spread codes naturally gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Finite Fields and Their Applications
دوره 25 شماره
صفحات -
تاریخ انتشار 2014